#include"AVLTree.h"

int main()
{
	AVL_Tree<int, int> t;
	int a[] = { 16, 3, 7, 11, 9, 26, 18, 14, 15 };
	int b[] = { 4, 2, 6, 1, 3, 5, 15, 7, 16, 14 };
	for (auto e : b)
		t.insert({ e,e });
	t.inorder();
	t.is_AVL();
	return 0;
}